Arity hierarchy for temporal logics

نویسنده

  • Alexander Moshe Rabinovich
چکیده

A major result concerning temporal logics is Kamp’s Theorem which states that the pair of modalities ‘‘until’’ and ‘‘since’’ is expressively complete for the first-order fragment of the monadic logic over the linear-time canonical model of naturals. The paper concerns the expressive power of temporal logics over trees. The main result states that in contrast to Kamp’s Theorem, for every n there is a modality of arity n definable by a monadic logic formula, which is not equivalent over trees to any temporal logic formula which uses modalities of arity less than n. Its proof takes advantage of an instance of Shelah’s composition theorem.This result has interesting corollaries, for instance reproving that CTL and ECTL have no finite basis. © 2008 Elsevier B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hierarchies in Inclusion Logic with Lax Semantics

We study the expressive power of fragments of inclusion logic under the so-called lax team semantics. The fragments are defined either by restricting the number of universal quantifiers or the arity of inclusion atoms in formulae. In case of universal quantifiers, the corresponding hierarchy collapses at the first level. Arity hierarchy is shown to be strict by relating the question to the stud...

متن کامل

Arity Hierarchies for Fixed-Point Logics

Fixed-point logic is the logic of inductively deenable relations over structures of a speciic signature. The inductive deenitions are given via expressions of the rst order logic or fragments of it. A natural question is whether we can increase the expressive power of the logic by allowing larger arities of the inductively deened relations. A number of results appeared lately that essentially s...

متن کامل

An Infinite Hierarchy of Temporal Logics over Branching Time

Many temporal logics were suggested as branching time specification formalisms during the last 20 years. These logics were compared against each other for their expressive power, model checking complexity and succinctness. Yet, unlike the case for linear time logics, no canonical temporal logic of branching time was agreed upon. We offer an explanation for the multiplicity of temporal logics ov...

متن کامل

The Unrestricted Combination of Temporal Logic Systems

This paper generalises and complements the work on combining temporal logics started by Finger and Gabbay [11, 10]. We present proofs of transference of soundness, completeness and decidability for the temporalisation of logics T(L) for any flow of time, eliminating the original restriction that required linear time for the transference of those properties through logic combination. We also gen...

متن کامل

Combining Spatial and Temporal Logics: Expressiveness vs. Complexity

In this paper, we construct and investigate a hierarchy of spatio-temporal formalisms that result from various combinations of propositional spatial and temporal logics such as the propositional temporal logic PT L, the spatial logics RCC-8, BRCC-8, S4u and their fragments. The obtained results give a clear picture of the trade-off between expressiveness and ‘computational realisability’ within...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 403  شماره 

صفحات  -

تاریخ انتشار 2008